An Algorithm for a 3D Simplicity Test
نویسندگان
چکیده
According to Kong [4], a thinning algorithm T is connectivity preserving if and only if every set deleted by T can Every thinning (or shrinking) algorithm can be stated as a list of deletion configurations. If a neighborhood of a given be ordered in such a sequence that every point is simple image point matches one of these configurations, the point will after all previous points in the sequence are deleted. To be deleted. In order to make design of a (3D) thinning (or prove a parallel thinning algorithm preserves connectivity, shrinking) algorithm easy to handle, and therefore the list of one must show it preserves connectivity for all possible configurations as short as possible, every configuration is deimages. But it could be difficult to check all images, since scribed in three colors, black, white, and ‘‘don’t-care,’’ where there are too many possible images. Ronsenfeld [11], the don’t-care ‘‘color’’ matches either a black or white point in Ronse [10], and Hall [3], proposed different techniques to a given image. A thinning algorithm is connectivity preserving if simplify the proof that a 2D thinning algorithm preserves and only if every set deleted by this algorithm can be ordered connectivity. Hall [2] and Ma [6] proposed corresponding in such a sequence that every point is simple after all previous 3D techniques, where Hall’s 3D results were extended points in the sequence are deleted. Therefore, it is very important to determine whether a deleted point is simple or not. from his 2D results, and Ma’s 3D results were based on We present the first 3D algorithm for determining the simplicity Ronse’s 2D results. All these techniques require that if a of any three-color deletion configuration. This algorithm is black point is deleted, the deletion of such a point does memory efficient and fast. Hence it can be a very useful tool for not change the connectivity of the image. Therefore, while designing 3D connectivity preserving thinning (or shrinking) designing a 3D thinning (or shrinking) algorithm, one has algorithms. 1996 Academic Press, Inc. to take care that every point deleted by the algorithm is simple. Every deletion condition can be stated as a list of dele
منابع مشابه
A New Restructured Shaded Pole Induction Motor- 3D Finite Element Analysis and Experimental Verification
Shaded pole induction motors, despite the simplicity and low cost, are difficult to analyze particularly in the equivalent circuit methods, due to the asymmetric structure, saturation, harmonics, inaccurate estimation of leakage inductances and skew. Hence, 3D numerical methods could be very useful in the design and optimization stage. This paper presents the 3D transient finite element analysi...
متن کاملمقایسه نتایج شبیهسازی بلور فوتونی با استفاده از روش FDTD دوبعدی بهبودیافته و FDTD سهبعدی
The accuracy of improved two dimensional finite difference time domain method (2D FDTD) is verified by comparing with 3D FDTD method and experimental data. The optimized 60° photonic crystal waveguide bend, used in this study as a test case, is composed of InPGaAs/InP material and air holes and TE polarization is considered. The photonic crystal waveguide bend transmission data was measured...
متن کاملAn Efficient Algorithm for General 3D-Seismic Body Waves (SSP and VSP Applications)
Abstract The ray series method may be generalized using a ray centered coordinate system for general 3D-heterogeneous media. This method is useful for Amplitude Versus Offset (AVO) seismic modeling, seismic analysis, interpretational purposes, and comparison with seismic field observations.For each central ray (constant ray parameter), the kinematic (the eikonal) and dynamic ray tracing system ...
متن کاملAutomatic estimation of regularization parameter by active constraint balancing method for 3D inversion of gravity data
Gravity data inversion is one of the important steps in the interpretation of practical gravity data. The inversion result can be obtained by minimization of the Tikhonov objective function. The determination of an optimal regularization parameter is highly important in the gravity data inversion. In this work, an attempt was made to use the active constrain balancing (ACB) method to select the...
متن کاملAssessment of a 2D EPID-based Dosimetry Algorithm for Pre-treatment and In-vivo Midplane Dose Verification
Introduction: The use of electronic portal imaging devices (EPIDs) is a method for the dosimetric verification of radiotherapy plans both pretreatment and in-vivo. The aim of this study was to test a 2D EPID-based dosimetry algorithm for dose verification of some plans inside a homogenous and anthropomorphic phantom and in-vivo, as well. Materials and Methods: </strong...
متن کاملA Comparative Study of VHDL Implementation of FT-2D-cGA and FT-3D-cGA on Different Benchmarks (RESEARCH NOTE)
This paper presents the VHDL implementation of fault tolerant cellular genetic algorithm. The goal of paper is to harden the hardware implementation of the cGA against single error upset (SEU), when affecting the fitness registers in the target hardware. The proposed approach, consists of two phases; Error monitoring and error recovery. Using innovative connectivity between processing elements ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Computer Vision and Image Understanding
دوره 63 شماره
صفحات -
تاریخ انتشار 1996